Surface Proofs for Nonsymmetric Linear Logic (Extended Abstract)
نویسندگان
چکیده
Multiplicative linear logic [6, 7] is a formal calculus for reasoning about resources, which is similar to traditional logic, except that resources cannot be duplicated or neglected in the way that propositions can. A central problem in logic is determining when two proofs should be considered equivalent. In this paper, we describe a scheme for interpreting proofs in multiplicative linear logic as geometrical surfaces embedded in 3d space. We define two surfaces as equivalent just when one can be deformed into the other, in sense we make precise. Our main theorem then reads as follows.
منابع مشابه
Full Intuitionistic Linear Logic (extended abstract)
Hyland, M. and V. de Paiva, Full intuitionistic linear logic (extended abstract), Annals of Pure and Applied Logic 64 (1993) 273-291. In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicati...
متن کاملProof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential commutations of rules. The only known extension to additives, based on monomial weights, fails to preserve this key feature: a host of cut-free monomial proof nets can correspond to the same cut-free proof. Thus the problem of finding a s...
متن کاملGames and Full Completeness for Multiplicative Linear Logic (Extended Abstract)
We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy;...
متن کاملLogic Programming with Bunched Implications (extended Abstract)
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...
متن کامل